A Framework for Optimizing Software Regression Test Case based on Modified-Ant Colony Optimization (M-ACO)
نویسندگان
چکیده
Software Regression Testing (SRT) helps with the modified code to ensure that no other new defects have been trained and significantly impact existing code. SRT is a time cost taking process. Test Case Prioritization (TCP) reschedule test cases (TC’S) picks according prioritization, which allows software testers maximize number of faults detected within given frame. Ant Colony Optimization (ACO) an optimization algorithm motivated by searching behavior insects. This paper proposes simple framework for novel Modified-ACO (m-ACO) prioritize TC’s. m-ACO planned as adjusted type ACO method, reschedules execution sequence TC’S changing wonder characteristic insects choosing their food source. The proposed Framework will help save execute It has tested Zasta Billing Web Application compared taken complete manually using Framework.The reduce from 90 days 45 achieve SRT.
منابع مشابه
An ACO-Based Reactive Framework for Ant Colony Optimization: First Experiments on Constraint Satisfaction Problems
We introduce two reactive frameworks for dynamically adapting some parameters of an Ant Colony Optimization (ACO) algorithm. Both reactive frameworks use ACO to adapt parameters: pheromone trails are associated with parameter values; these pheromone trails represent the learnt desirability of using parameter values and are used to dynamically set parameters in a probabilistic way. The two frame...
متن کاملGradient-based Ant Colony Optimization for Continuous Spaces
A novel version of Ant Colony Optimization (ACO) algorithms for solving continuous space problems is presented in this paper. The basic structure and concepts of the originally reported ACO are preserved and adaptation of the algorithm to the case of continuous space is implemented within the general framework. The stigmergic communication is simulated through considering certain direction vect...
متن کاملGradient-based Ant Colony Optimization for Continuous Spaces
A novel version of Ant Colony Optimization (ACO) algorithms for solving continuous space problems is presented in this paper. The basic structure and concepts of the originally reported ACO are preserved and adaptation of the algorithm to the case of continuous space is implemented within the general framework. The stigmergic communication is simulated through considering certain direction vect...
متن کاملA reactive framework for Ant Colony Optimization
We introduce two reactive frameworks for dynamic adapating some parameters of an Ant Colony Optimization (ACO) algorithm. Both reactive frameworks use ACO to adapt parameters: pheromone trails are associated with parameter values; these pheromone trails represent the learnt desirability of using parameter values and are used to dynamically set parameters in a probabilistic way. The two framewor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ITM web of conferences
سال: 2022
ISSN: ['2271-2097', '2431-7578']
DOI: https://doi.org/10.1051/itmconf/20224201007